Programming complexity - PDFSEARCH.IO - Document Search Engine

Programming complexity
Results: 456

#	Item
21	IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. X, Add to Reading List Source URL: www.cs.uoi.gr Language: English - Date: 2014-10-21 22:17:09 Mathematics Operations research Computational complexity theory Combinatorics Combinatorial optimization NP-complete problems Set cover problem Greedy algorithm Heuristic Integer programming Matching Linear programming
22	Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011 Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:43:49 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Operations research Asymptotic analysis Combinatorial optimization Dynamic programming Master theorem Big O notation Knapsack problem Time complexity
23	A SAT-based Method for Solving the Two-dimensional Strip Packing Problem Takehide Soh1 , Katsumi Inoue12 , Naoyuki Tamura3 , Mutsunori Banbara3 , and Hidetomo Nabeshima4 1 Add to Reading List Source URL: ceur-ws.org Language: English - Date: 2008-12-04 03:03:05 Theoretical computer science Computational complexity theory Mathematics Constraint programming Numerical software Automated theorem proving DPLL algorithm Packing problems Solver Constraint satisfaction Reduction Algorithm
24	On the Optimality of Top-k Algorithms for Interactive Web Applications∗ Yael Amsterdamer Daniel Deutch Add to Reading List Source URL: webdb2011.rutgers.edu Language: English - Date: 2011-05-31 18:17:42 Computational complexity theory Mathematics Edsger W. Dijkstra Graph theory Algorithm Mathematical logic Theoretical computer science Shortest path problem NP Dynamic programming
25	PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡ Add to Reading List Source URL: users.eecs.northwestern.edu Language: English - Date: 2009-09-15 22:21:32 Computational complexity theory Mathematics Theory of computation NP-complete problems Operations research Approximation algorithms Combinatorial optimization Set cover problem Linear programming relaxation Greedy algorithm Facility location problem Reduction
26	MATHEMATICAL ENGINEERING TECHNICAL REPORTS Sparse Linear Complementarity Problems Hanna SUMITA, Naonori KAKIMURA, and Add to Reading List Source URL: www.keisu.t.u-tokyo.ac.jp Language: English - Date: 2013-01-25 04:57:12 Computational complexity theory Mathematics Operations research Algebra Linear algebra Linear complementarity problem Mathematical optimization Linear programming NP Inequality Time complexity LCP array
27	A maximum feasible linear subsystem problem for modeling noise pollution around airports Sandra Hommersom) Add to Reading List Source URL: www.math.ru.nl Language: English - Date: 2016-04-12 05:51:20 Computational complexity theory Theory of computation Mathematics Operations research Complexity classes Mathematical optimization Structural complexity theory Theoretical computer science NP Linear programming Algorithm Reduction
28	CS264: Homework #8 Due by midnight on Wednesday, November 19, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should also complete Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-14 09:53:16 Computational complexity theory Operations research Theory of computation Mathematics Knapsack problem Optimization problem NP Mathematical optimization Polynomial-time approximation scheme Dynamic programming Time complexity Isolation lemma
29	May 19, Spring 2011 Final Exam Introduction to Algorithms Massachusetts Institute of Technology Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2011-05-20 09:47:26 Mathematics Computational complexity theory Mathematical analysis Analysis of algorithms Operations research Mathematical notation Asymptotic analysis Dynamic programming Big O notation Time complexity Recurrence relation Knapsack problem
30	Early-Deciding Consensus is Expensive Danny Dolev Christoph Lenzen Hebrew University of Jerusalem Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:04 Computing Computational complexity theory Fault-tolerant computer systems Knowledge representation Consensus Distributed computing Tree Randomized algorithm Computer programming